@InProceedings{SkalaSmolMajd:2016:ReNuPo,
               author = "Skala, Vaclav and Smolik, Michal and Majdisova, Zuzana",
          affiliation = "{University of West Bohemia} and {University of West Bohemia} and 
                         {University of West Bohemia}",
                title = "Reducing the number of points on the convex hull calculation using 
                         the polar space subdivision in E2",
            booktitle = "Proceedings...",
                 year = "2016",
               editor = "Aliaga, Daniel G. and Davis, Larry S. and Farias, Ricardo C. and 
                         Fernandes, Leandro A. F. and Gibson, Stuart J. and Giraldi, Gilson 
                         A. and Gois, Jo{\~a}o Paulo and Maciel, Anderson and Menotti, 
                         David and Miranda, Paulo A. V. and Musse, Soraia and Namikawa, 
                         Laercio and Pamplona, Mauricio and Papa, Jo{\~a}o Paulo and 
                         Santos, Jefersson dos and Schwartz, William Robson and Thomaz, 
                         Carlos E.",
         organization = "Conference on Graphics, Patterns and Images, 29. (SIBGRAPI)",
            publisher = "IEEE Computer Society´s Conference Publishing Services",
              address = "Los Alamitos",
             keywords = "Convex hull, iterative approximation, space subdivision, reduction 
                         of points.",
             abstract = "A convex hull of points in E2 is used in many applications. In 
                         spite of low computational complexity O(h log\⁡n ) it takes 
                         considerable time if large data processing is needed. We present a 
                         new algorithm to speed up any planar convex hull calculation. It 
                         is based on a polar space subdivision and speed up known convex 
                         hull algorithms of 3,7 times and more. The algorithm estimates the 
                         central point using 10% of the data; this point is taken as the 
                         origin for the polar subdivision. The space subdivision enables a 
                         fast and very efficient reduction of the given points, which 
                         cannot contribute to the final convex hull. The proposed algorithm 
                         iteratively approximates the convex hull, leaving only a small 
                         number of points for the final processing, which is performed 
                         using a standard algorithm. Non-eliminated points are then 
                         processed by a selected standard convex hull algorithm. The 
                         algorithm is simple and easy to implement. Experiments proved 
                         numerical robustness as well.",
  conference-location = "S{\~a}o Jos{\'e} dos Campos, SP, Brazil",
      conference-year = "4-7 Oct. 2016",
                  doi = "10.1109/SIBGRAPI.2016.015",
                  url = "http://dx.doi.org/10.1109/SIBGRAPI.2016.015",
             language = "en",
                  ibi = "8JMKD3MGPAW/3M58PMH",
                  url = "http://urlib.net/ibi/8JMKD3MGPAW/3M58PMH",
           targetfile = "ConvexHull [SIBGRAPI_2016].pdf",
        urlaccessdate = "2024, May 01"
}